Linear Algebra ALGOL

نویسنده

  • J. H. WILKINSON
چکیده

Theoret ica l B a c k g r o u n d The procedure bisect is designed to replace the procedures tridibi I and 2 given in ES]. All three procedures are based essentially on the following theorem. Given a symmetric tridiagonal matrix with diagonal elements q to cn and off-diagonal elements b, to b, (with b 1 set equal to zero for completeness) and b i 4=0, then for any number 2 let the sequence Po (2) . . . . . p~ (2) be defined b y

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bibliography of Publications in The Computer Journal: 1958–1999

[?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?]. Abstraction [?, ?, ?, ?, ?]. Abstractions [?, ?, ?, ?]. abuse [?]. Accelerate [?]. Accelerated [?]. Accelerating [?, ?]. acceleration [?]. Acceptance [?, ?, ?]. Access [?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?]. Access-Control [?]. Accesses [?, ?]. Accessing [?, ?, ?]. accommodate [?]. according [?, ?, ?, ?]. Acc...

متن کامل

Contraction Algebras and Unification of (Infinite) Terms

We introduce the class of contraction algebras in which the algebra of infinite and finite terms is free over the set of variables. We develop a general theory of systems of equations at the level of categories in close connection with the Banach Principle of Contraction. Two applications of this theory are given. The first is the case of regular systems of equations with arbitrary terms. The s...

متن کامل

The Formal Termination Problem for Programs with Finite ALGOL 68-Modes

In f 1 l] the importance of the formal termination problem for a high level programming language has been pointed out. If this problem is algorithmically solvable, then the translator is at least principally able to check whether certain properties closely related to termination like macro property of programs or nonrecursivity or block behaviour of procedures are fulfilled and then to produce ...

متن کامل

An Algorithm with Guaranteed Convergence for Finding a Zero of a Function

An algorithm is presented for finding a zero of a function which changes sign in a given interval. The algorithm combines linear interpolation and inverse quadratic interpolation with bisection. Convergence is usually superlinear, and is never much slower than for bisection. ALGOL 60 procedures are given. CommentsOnly the Abstract is given here. The full paper appeared as [1]. For similar m...

متن کامل

Building Algebra Systems by Overloading Lisp

Some of the earliest computer algebra systems (CAS) looked like overloaded languages of the same era. FORMAC, PL/I FORMAC, Formula Algol, and others, each took advantage of a pre-existing language base and expanded the notion of a numeric value to include mathematical expressions. Much more recently, perhaps encouraged by the growth in popularity of C++, we have seen a renewal of the use of ove...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005